No Return Pictured

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

No return to convexity

In the paper we study closures of classes of log–concave measures under taking weak limits, linear transformations and tensor products. We consider what uniform measures on convex bodies can one obtain starting from some class K. In particular we prove that if one starts from one–dimensional log–concave measures, one obtains no non– trivial uniform mesures on convex bodies.

متن کامل

Allergy receptor pictured.

were implanted s.c. into the rat thigh. NMR T, values of the adjacent normal muscle, resulting from local inflammatory reactions or from malignant invasion, were measured. Elevations in T, of the underlying muscle occurred within 24 h in both experiments, and it is believed these were caused by rapid inflammatory and immunological reactions to the implants. However the T, values of muscle sampl...

متن کامل

Summarization for termination: no return!

We propose a program analysis method for proving termination of recursive programs. The analysis is based on a reduction of termination to two separate problems: reachability of recursive programs, and termination of non-recursive programs. Our reduction works through a program transformation that modifies the call sites and removes return edges. In the new, non-recursive program, a procedure c...

متن کامل

Games of no return a

Let D = (V,A) be a finite directed graph (digraph) each vertex v ∈ V of which is interpreted as a position and each arc a = (v, v′) ∈ A as a possible move from position v to v′. Two players, 1 and 2, take turns moving a token from a given initial position v0. The game ends as soon as the token returns to a position, where it has already been. By definition, the player who made the last move los...

متن کامل

Summarization For Termination: No Return! (DRAFT)

We propose a program analysis method for proving termination of recursive programs. The analysis is based on a reduction of termination to two separate problems: reachability of recursive programs, and termination of non-recursive programs. Our reduction works through a program transformation that modifies the call sites and removes return edges. In the new, non-recursive program, a procedure c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Cultural and Pedagogical Inquiry

سال: 2017

ISSN: 1916-3460

DOI: 10.18733/c3sh4w